Numerical Verification Method for Arbitrarily Ill-conditioned Linear Systems

نویسندگان

  • S. M. Rump
  • Takahisa Ohta
  • Takeshi Ogita
  • Siegfried M. Rump
  • Shin’ichi Oishi
چکیده

This paper is concerned with the problem of verifying an accuracy of a numerical solution of a linear system with an arbitrarily ill-conditioned coefficient matrix. In this paper, a method of obtaining an accurate numerical solution of such a linear system and its verified error bound is proposed. The proposed method is based on the accurate computation of dot product and IEEE standard 754 arithmetic. A verified and accurate numerical solution with a desired tolerance can be obtained by the proposed method with iterative refinement. Numerical results are presented for illustrating the effectiveness of the proposed method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming

 Abstract  We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...

متن کامل

Convergence of Rump’s Method for Inverting Arbitrarily Ill-Conditioned Matrices

In this paper, the problem of inverting regular matrices with arbitrarily large condition number is treated in double precision defined by IEEE 754 floating point standard. In about 1984, Rump derived a method for inverting arbitrarily ill-conditioned matrices. The method requires the possibility to calculate a dot product in higher precision. Rump’s method is of theoretical interest. Rump made...

متن کامل

Iterative Methods for Ill-conditioned Linear Systems from Optimization

Preconditioned conjugate-gradient methods are proposed for solving the ill-conditioned linear systems which arise in penalty and barrier methods for nonlinear minimization. The preconditioners are chosen so as to isolate the dominant cause of ill conditioning. The methods are stablized using a restricted form of iterative reenement. Numerical results illustrate the approaches considered.

متن کامل

A New Method for Solving Ill-conditioned Linear Systems

An accurate numerical method is established for matrix inversion. It is shown theoretically that the scheme possesses the high order of convergence of seven. Subsequently, the method is taken into account for solving linear systems of equations. The accuracy of the contributed iterative method is clarified on solving numerical examples when the coefficient matrices are ill-conditioned. All of t...

متن کامل

Acceleration of a Preconditioning Method for Ill-Conditioned Dense Linear Systems by Use of a BLAS-based Method

We are interested in accurate numerical solutions of ill-conditioned linear systems using floating-point arithmetic. Recently, we proposed a preconditioning method to reduce the condition numbers of coefficient matrices. The method utilizes an LU factorization obtained in working precision arithmetic and requires matrix multiplication in quadruple precision arithmetic. In this note, we aim to a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005